Constraint Handling Rules - What Else?
نویسنده
چکیده
Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple, CHR is distinguished by a remarkable combination of desirable features: – a semantic foundation in classical and linear logic, – an effective and efficient sequential and parallel execution model – guaranteed properties like the anytime online algorithm properties – powerful analysis methods for deciding essential program properties. This overview of some CHR-related research and applications is by no means meant to be complete. Essential introductory reading for CHR provide the survey article [125] and the books [56, 63]. Up-to-date information on CHR can be found online at the CHR web-page www. constraint-handling-rules.org, including the slides of the keynote talk associated with this article. In addition, the CHR website dtai. cs.kuleuven.be/CHR/ offers everything you want to know about CHR, including online demo versions and free downloads of the language.
منابع مشابه
Constraint Handling Rules - What Else?
Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple, CHR is distinguished by a remarkable combination of desirable features: – a semantic foundation in classical and linear logic, – an effective and efficient sequential and parallel execution model – guaranteed proper...
متن کاملOn Connuence of Constraint Handling Rules on Connuence of Constraint Handling Rules
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کاملExpressive power of Constraint Handling Rules extensions and fragments
Constraints can be used in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a pragmatic point of view. In this work we study the expressive power of a concurrent language, namely Constraint Handling Rules, that supports constraints as a primitive construct. We show what features of this language make it Turing powerful and what happens to its ...
متن کاملOn Con uence of Constraint Handling
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کاملOn Con uence of Constraint Handling RulesSlim
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015